#include<bits/stdc++.h>

using namespace std;
using ll = long long;
#define endl '\n'

template<typename T=int>
inline T read() {
    T x;
    cin >> x;
    return x;
}

int a[100 + 1];
int n = 10;

/**
 * 冒泡排序的递归实现
 * @param a
 * @param left
 * @param right
 */
void bubble_sort(int *a, int left, int right) {
    if (left >= right)return;
    for (int i = left; i + 1 <= right; i++) {
        if (a[i] > a[i + 1])swap(a[i], a[i + 1]);
    }
    bubble_sort(a, left, right - 1);

}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    for (int i = 0; i < n; i++)cin >> a[i];
    bubble_sort(a, 0, n - 1);
    copy(a, a + n, ostream_iterator<int>(cout, "\n"));
    cout << endl;
    return 0;
}
